RANDOM WALKS WITH k-WISE INDEPENDENT INCREMENTS
نویسندگان
چکیده
We construct examples of a random walk with pairwise-independent steps which is almost-surely bounded, and for any m and k a random walk with k-wise independent steps which has no stationary distribution modulo m.
منابع مشابه
Level Crossing Probabilities I: One-dimensional Random Walks and Symmetrization
Abstract. We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is O(n). Moment or symmetry assumptions are not necessary. In removing symmetry the (sharp) inequality P (|X+Y | ≤ 1) < 2P (|X−Y | ≤ 1) for independent identically distributed X, Y is used. In part II we shall discuss the connection of this resul...
متن کاملAsymptotics for Random Walks with Dependent Heavy-tailed Increments
Abstract: We consider a random walk {Sn} with dependent heavy-tailed increments and negative drift. We study the asymptotics for the tail probability P{supn Sn > x} as x→∞. If the increments of {Sn} are independent then the exact asymptotic behavior of P{supn Sn > x} is well known. We investigate the case in which the increments are given as a one-sided asymptotically stationary linear process....
متن کاملLocalization for controlled random walks and martingales
We consider controlled random walks that are martingales with uniformly bounded increments and nontrivial jump probabilities and show that such walks can be constructed so that P (Su n = 0) decays at polynomial rate n where α > 0 can be arbitrarily small. We also show, by means of a general delocalization lemma for martingales, which is of independent interest, that slower than polynomial decay...
متن کاملLevel Crossing Probabilities Ii: Polygonal Recurrence of Multidimensional Random Walks
In part I (math.PR/0406392) we proved for an arbitrary onedimensional random walk with independent increments that the probability of crossing a level at a given time n is O(n). In higher dimensions we call a random walk ’polygonally recurrent’ (resp. transient) if a.s. infinitely many (resp. finitely many) of the straight lines between two consecutive sites hit a given bounded set. The above e...
متن کاملFrom persistent random walks to the telegraph noise
We study a family of memory-based persistent random walks and we prove weak convergences after space-time rescaling. The limit processes are not only Brownian motions with drift. We have obtained a continuous but non-Markov process (Zt) which can be easely expressed in terms of a counting process (Nt). In a particular case the counting process is a Poisson process, and (Zt) permits to represent...
متن کامل